Confluence of Graph Transformation Revisited
نویسنده
چکیده
It is shown that it is undecidable in general whether a terminating graph rewriting system is confluent or not—in contrast to the situation for term and string rewriting systems. Critical pairs are introduced to hypergraph rewriting, a generalisation of graph rewriting, where it turns out that the mere existence of common reducts for all critical pairs of a graph rewriting system does not imply local confluence. A Critical Pair Lemma for hypergraph rewriting is then established which guarantees local confluence if each critical pair of a system has joining derivations that are compatible in that they map certain nodes to the same nodes in the common reduct.
منابع مشابه
Adhesivity Is Not Enough: Local Church-Rosser Revisited
Adhesive categories provide an abstract setting for the doublepushout approach to rewriting, generalising classical approaches to graph transformation. Fundamental results about parallelism and confluence, including the local Church-Rosser theorem, can be proven in adhesive categories, provided that one restricts to linear rules. We identify a class of categories, including most adhesive catego...
متن کاملConfluence of Typed Attributed Graph Transformation Systems
The issue of confluence is of major importance for the successful application of attributed graph transformation, such as automated translation of UML models into semantic domains. Whereas termination is undecidable in general and must be established by carefully designing the rules, local confluence can be shown for term rewriting and graph rewriting using the concept of critical pairs. In thi...
متن کاملEfficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are required properties. Only under these two conditions, existence and uniqueness of the outcoming model is ensured. Verifying confluence of a graph transformation system is equivalent to checking both local confluence and termination. A graph transformation ...
متن کاملTowards Local Confluence Analysis for Amalgamated Graph Transformation
Amalgamated graph transformation allows to define schemes of rules coinciding in common core activities and differing over additional parallel independent activities. Consequently, a rule scheme is specified by a kernel rule and a set of extending multi-rules forming an interaction scheme. Amalgamated transformations have been increasingly used in various modeling contexts. Critical Pair Analys...
متن کاملAnalysis Techniques for Graph Transformation Systems
In software and system development, verification and validation means investigating artifacts in order to check if they fulfill the intended purposes. Graph transformation systems can be considered as precise models of computation where states are represented by graphs and state changes by rule-based graph transformations. This talk gives an overview of selected analysis techniques being availa...
متن کامل